Triangle-free graphs with no six-vertex induced path
نویسندگان
چکیده
منابع مشابه
Triangle-free graphs with no six-vertex induced path
The graphs with no five-vertex induced path are still not understood. But in the triangle-free case, we can do this and one better; we give an explicit construction for all triangle-free graphs with no six-vertex induced path. Here are two examples: the 16-vertex Clebsch graph, and the graph obtained from a complete bipartite graph by subdividing a perfect matching. We show that every connected...
متن کاملThree-coloring graphs with no induced seven-vertex path I : the triangle-free case
In this paper, we give a polynomial time algorithm which determines if a given triangle-free graph with no induced seven-vertex path is 3-colorable, and gives an explicit coloring if one exists.
متن کاملThree-coloring graphs with no induced seven-vertex path II : using a triangle
In this paper we give a polynomial time algorithm which determines if a given graph containing a triangle and no induced seven-vertex path is 3-colorable, and gives an explicit coloring if one exists. This is the second paper in a series of two. The first one, [3] is also submitted to this journal. In [2, 3], a polynomial time algorithm is given for three-coloring triangle-free graphs with no i...
متن کاملGraphs with no induced five-vertex path or antipath
We prove that a graph G contains no induced 5-vertex path and no induced complement of a 5-vertex path if and only if G is obtained from 5-cycles and split graphs by repeatedly applying the following operations: substitution, split unification, and split unification in the complement, where split unification is a new class-preserving operation introduced here. ∗Princeton University, Princeton, ...
متن کاملTriangle-Free Geometric Intersection Graphs with No Large Independent Sets
It is proved that there are triangle-free intersection graphs of line segments in the plane with arbitrarily small ratio between the maximum size of an independent set and the total number of vertices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2018
ISSN: 0012-365X
DOI: 10.1016/j.disc.2018.04.020